Triangular Factorization and Inversion by Fast Matrix Multiplication

نویسندگان

  • James R. Bunch
  • John E. Hopcroft
  • JOHN E. HOPCROFT
چکیده

The fast matrix multiplication algorithm by Strassen is used to obtain the triangular factorization of a permutation of any nonsingular matrix of ordern in <Cxnlos'7 operations, and, hence, the inverse of any nonsingular matrix in <Cürtlog'7 operations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-performance and Parallel Inversion of a Symmetric Positive Definite Matrix

We present families of algorithms for operations related to the computation of the inverse of a Symmetric Positive Definite (SPD) matrix: Cholesky factorization, inversion of a triangular matrix, multiplication of a triangular matrix by its transpose, and one-sweep inversion of an SPD matrix. These algorithms are systematically derived and implemented via the Formal Linear Algebra Methodology E...

متن کامل

Stability of Methods for Matrix Inversion

Inversion of a triangular matrix can be accomplished in several ways. The standard methods are characterised by the loop ordering, whether matrix-vector multiplication, solution of a triangular system, or a rank-1 update is done inside the outer loop, and whether the method is blocked or unblocked. The numerical stability properties of these methods are investigated. It is shown that unblocked ...

متن کامل

Incomplete Cholesky Parallel Preconditioners with Selective Inversion

Consider the solution of a large linear system when the coe cient matrix is sparse, symmetric, and positive de nite. One approach is the method of \conjugate gradient" (CG) with an incomplete Cholesky (IC) preconditioner (ICCG). A key problem with the design of a parallel ICCG solver is the bottleneck posed by repeated parallel sparse triangular solves to apply the preconditioner. Our work conc...

متن کامل

Contemporary Mathematics The Schur algorithm for matrices with Hessenberg displacement structure

A Schur-type algorithm is presented for computing recursively the triangular factorization R = LU of a strongly nonsingular n n matrix satisfying a displacement equation RY V R = GH with Hessenberg matrices Y and V and n matrices G, H. If is small compared with n and the matrices Y and V admit fast matrix-vector multiplication, the new algorithm is fast in the sense that it will require less th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010